Modal Definability Based on Łukasiewicz Validity Relations
نویسنده
چکیده
We study two notions of definability for classes of relational structures based on modal extensions of Łukasiewicz finitely-valued logics. The main results of the paper are the equivalent of the Goldblatt Thomason theorem for these notions of definability.
منابع مشابه
A Reconstruction of Aristotle’s Modal Syllogistic
Ever since Łukasiewicz, it has been opinio communis that Aristotle’s modal syllogistic is incomprehensible due to its many faults and inconsistencies, and that there is no hope of finding a single consistent formal model for it. The aim of this paper is to disprove these claims by giving such a model. My main points shall be, first, that Aristotle’s syllogistic is a pure term logic that does no...
متن کاملUniform Rules and Dialogue Games for Fuzzy Logics
We provide uniform and invertible logical rules in a framework of relational hypersequents for the three fundamental t-norm based fuzzy logics i.e., Łukasiewicz logic, Gödel logic, and Product logic. Relational hypersequents generalize both hypersequents and sequents-of-relations. Such a framework can be interpreted via a particular class of dialogue games combined with bets, where the rules re...
متن کاملModal Definability over a Class of Structures with Two Equivalence Relations
More than 40 years the correspondence between modal logic and first-order logic, when they are interpreted in relational structures, is on the main stream of the investigations of many modal logicians. The most interesting in this direction is a series of results on modal and first-order definability proved by Chagrova in the 1990s. In particular, from them it follows the undecidability of both...
متن کاملImplicit definability of truth constants in Łukasiewicz logic
In the framework of propositional Lukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly defining each of the rational elements in the standard semantics are explored, and based on that, a faithful interpretation of theories in Rational Pavelka logic ...
متن کاملŁukasiewicz μ-calculus
The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 104 شماره
صفحات -
تاریخ انتشار 2016